Symbolic Verification of Statecharts

We present an approach for the verification of Statechart specifications. In contrast to other work on Statecharts verification, our approach satisfies the synchrony assumption and handles trigger expressions with negations in a satisfactory way. Our semantic model uses two transition relations. A macrostep relation describes the observable behaviour of the statechart. It is defined through a microstep relation, which describes the chainreactions of transitions. By employing the negation as failure model from logic programming for negated events in trigger expressions, we ensure that our model is globally consistent. We built a prototype tool based on BDDs, and tested it on a small example. keyword: Statecharts, Verification, Binary Decision Diagrams, Negation as Failure.